A Lagrangian Relaxation-Based Solution Method for a Green Vehicle Routing Problem to Minimize Greenhouse Gas Emissions
نویسندگان
چکیده
The effects of greenhouse gas (GHG) on the weather has caused ever-increasing disasters around the world. Many countries are making significant efforts to reduce GHG emissions in all industrial sectors. In this study, a green vehicle routing problem (GVRP) has been formulated as a nonlinear integer programming problem to minimize GHG emissions, considering various realistic factors that include three-dimensional customer locations, gravity, vehicle speed, vehicle operating time, vehicle capacity, rolling resistance, air density, road grade and inertia. Lagrangian relaxation has been introduced to propose a simple solution method. In contrast to traditional vehicle routing problems, the vehicle speed, vehicle weight, and road grade between two customer locations are also determined along with vehicle routes. The computational results demonstrate the effectiveness and efficiency of the proposed solution method.
منابع مشابه
Three New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem
In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملA Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem
Nowadays, a rapid growth in the rate of life expectancy can be seen especially in the developed countries. Accordingly, the population of elderlies has been increased. By another point of view, the number of hospitals, retirement homes along with medical staffs has not been grown with a same rate. Hence, Home Health Care (HHC) operations including a set of nurses and patients have been develope...
متن کاملA Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm
Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routi...
متن کاملTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کامل